Homotopy trees: Essential height and roots

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Profile and Height of Random Binary Search Trees

The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.

متن کامل

On the Height of a Homotopy

Given 2 homotopic curves in a topological space, there are several ways to measure similarity between the curves, including Hausdorff distance and Fréchet distance. In this paper, we examine a different measure of similarity which considers the family of curves represented in the homotopy between the curves, and measures the longest such curve, known as the height of the homotopy. In other word...

متن کامل

The Average Height of Binary Trees and Other Simple Trees

The average height of a binary tree with n internal nodes is shown to be asymptotic to 2 6. This represents the average stack height of the simplest recursive tree traversal algorithm. The method used in this estimation is also applicable to the analysis of traversal algorithms of unary-binary trees, unbalanced 2-3 trees, t-ary trees for any t, and other families of trees. It yields the two pre...

متن کامل

The Height of Increasing Trees

Increasing trees have been introduced by Bergeron, Flajolet and Salvy [1]. This kind of notion covers several well knows classes of random trees like binary search trees, recursive trees, and plane oriented (or heap ordered) trees. We consider the height of increasing trees and prove for several classes of trees (including the above mentioned ones) that the height satisfies EHn ∼ γ logn (for so...

متن کامل

The height of increasing trees

We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of nodes converge in distribution. The height of these trees is shown to be in probability asymptotic to c logn for some constant c. We apply our results to obtain a law of large numbers for the height of all polynomial varie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Illinois Journal of Mathematics

سال: 1976

ISSN: 0019-2082

DOI: 10.1215/ijm/1256049900